Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers
نویسندگان
چکیده
We study the previously introduced bracketed tiling construction and obtain direct proofs of some identities for the Fibonacci and Lucas numbers. By adding a new type of tile we call a superdomino to this construction, we obtain combinatorial proofs of some formulas for the Fibonacci and Lucas polynomials, which we were unable to find in the literature. Special cases of these formulas occur in the text by Benjamin and Quinn, where the question of finding their combinatorial proofs is raised. In the process, we also show, via direct bijections, that the bracketed (2n)-bracelets as well as the linear bracketed (2n + 1)-tilings both number 5n.
منابع مشابه
The 99th Fibonacci Identity
In the book Proofs that Really Count [1], the authors use combinatorial arguments to prove many identities involving Fibonacci numbers, Lucas numbers, and their generalizations. Among these, they derive 91 of the 118 identities mentioned in Vajda’s book [2], leaving 27 identities unaccounted. Eight of these identities, presented later in this paper, have such a similar appearance, the authors r...
متن کاملOn the Properties of Balancing and Lucas-Balancing $p$-Numbers
The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.
متن کاملTiling Proofs of Some Fibonacci-lucas Relations
We provide tiling proofs for some relations between Fibonacci and Lucas numbers, as requested by Benjamin and Quinn in their text, Proofs that Really Count. Extending our arguments yields Gibonacci generalizations of these identities.
متن کاملFibonacci Identities and Graph Colorings
We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as Fr+s+t = Fr+1Fs+1Ft+1 + FrFsFt − Fr−1Fs−1Ft−1.
متن کاملIdentities for Fibonacci and Lucas Polynomials derived from a book of Gould
This note is dedicated to Professor Gould. The aim is to show how the identities in his book ”Combinatorial Identities” can be used to obtain identities for Fibonacci and Lucas polynomials. In turn these identities allow to derive a wealth of numerical identities for Fibonacci and Lucas numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011